Fundamentals of Quaternionic Kinematics in Euclidean 4-Space

Based on a kinematic mapping for the group SE(4) of displacements of Euclidean 4-space, we show that the mapping of basic elements (points, oriented lines, oriented planes, oriented hyperplanes, instantaneous screws) can be written compactly in terms of 2 × 2 quaternionic matrices. Moreover we discuss the kinematics on the velocity level by investigating instantaneous screws and their geometric parameters.     

The Steiner connectivity problem

The Steiner connectivity problem has the same significance for line planning in public transport as the Steiner tree problem for telecommunication network design. It consists in finding a minimum cost set of elementary paths to connect a subset of nodes in an undirected graph and is, therefore, a generalization of the Steiner tree problem. We propose an extended directed cut formulation for the problem which is, in comparison to the canonical undirected cut formulation, provably strong, implying, e.g., a class of facet defining Steiner partition inequalities. Since a direct application of this formulation is computationally intractable for large instances, we develop a partial projection method to produce a strong relaxation in the space of canonical variables that approximates the extended formulation. We also investigate the separation of Steiner partition inequalities and give computational evidence that these inequalities essentially close the gap between undirected and extended directed cut formulation. Using these techniques, large Steiner connectivity problems with up to 900 nodes can be solved within reasonable optimality gaps of typically less than five percent.     

Planar Stewart Gough platforms with a type II DM self-motion

Due to previous publications of the author, it is already known that one-parametric self-motions of general planar Stewart Gough platforms can be classified into two so-called Darboux Mannheim (DM) types (I and II). Moreover, the author also proved the necessity of three conditions for obtaining a type II DM self-motion. Based on this result we determine in the article at hand, all general planar Stewart Gough platforms with a type II DM self-motion. This is an important step in the solution of the famous Borel Bricard problem.     

有向图4-→Cn的优美性

研究了有向图m→C n 的优美性,利用搜索图的标号的算法与数学证明相结合的方法,证明了有向图4→ Cn 为优美图,其中n为任意正整数。     

Convex equipartitions: the spicy chicken theorem

We show that, for any prime power $n$ and any convex body $K$ (i.e., a compact convex set with interior) in $\mathbb{R }^d$ , there exists a partition of $K$ into $n$ convex sets with equal volumes and equal surface areas. Similar results regarding equipartitions with respect to continuous functionals and absolutely continuous measures on convex bodies are also proven. These include a generalization of the ham-sandwich theorem to arbitrary number of convex pieces confirming a conjecture of Kaneko and Kano, a similar generalization of perfect partitions of a cake and its icing, and a generalization of the Gromov–Borsuk–Ulam theorem for convex sets in the model spaces of constant curvature.     

Cycles Containing a Subset of a Given Set of Elements in Cubic Graphs

The technique of contractions and the known results in the study of cycles in $3$-connected cubic graphs are applied to obtain the following result. Let $G$ be a $3$-connected cubic graph, $X\subseteq V(G)$ with $|X| = 16$ and $e\in E(G)$. Then either for every $8$-subset $A$ of $X$, $A\cup\{e\}$ is cyclable or for some $14$-subset $A$ of $X$, $A\cup\{e\}$ is cyclable.     

The critical behavior of random digraphs

We study the critical behavior of the random digraph D(n,p) for np = 1 + ε, where ε = ε(n) = o(1). We show that if ε³n →—∞, then a.a.s. D(n,p) consists of components which are either isolated vertices or directed cycles, each of size O_p(|ε|^?1). On the other hand, if ε³n →∞, then a.a.s. the structure of D(n,p) is dominated by the unique complex component of size (4 + o(1))ε²n, whereas all other components are of size O_p(ε^?1). © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009